Optimized projections for compressed sensing via rank-constrained nearest correlation matrix

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimized projections for compressed sensing via rank-constrained nearest correlation matrix

Optimizing the acquisition matrix is useful for compressed sensing of signals that are sparse in overcomplete dictionaries, because the acquisition matrix can be adapted to the particular correlations of the dictionary atoms. In this paper a novel formulation of the optimization problem is proposed, in the form of a rank-constrained nearest correlation matrix problem. Furthermore, improvements ...

متن کامل

Optimized Projections for Compressed Sensing via Direct Mutual Coherence Minimization

Compressed Sensing (CS) is a novel technique for simultaneous signal sampling and compression based on the existence of a sparse representation of signal and a projected dictionary PD, where P ∈ Rm×d is the projection matrix and D ∈ Rd×n is the dictionary. To exactly recover the signal with a small number of measurements m, the projected dictionary PD is expected to be of low mutual coherence. ...

متن کامل

ROP: Matrix Recovery via Rank-One Projections

Estimation of low-rank matrices is of significant interest in a range of contemporary applications. In this paper, we introduce a rank-one projection model for low-rank matrix recovery and propose a constrained nuclear norm minimization method for stable recovery of low-rank matrices in the noisy case. The procedure is adaptive to the rank and robust against small low-rank perturbations. Both u...

متن کامل

Spectral Compressed Sensing via Structured Matrix Completion

The paper studies the problem of recovering a spectrally sparse object from a small number of time domain samples. Specifically, the object of interest with ambient dimension n is assumed to be a mixture of r complex multi-dimensional sinusoids, while the underlying frequencies can assume any value in the unit disk. Conventional compressed sensing paradigms suffer from the basis mismatch issue ...

متن کامل

Supplemental Materials for “ Spectral Compressed Sensing via Structured Matrix Completion ”

This supplemental document presents details concerning analytical derivations that support the theorems made in the main text " Spectral Compressed Sensing via Structured Matrix Completion " , accepted to the 30th International Conference on Machine Learning (ICML 2013). One can find here the detailed proof of Theorems 1-3.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied and Computational Harmonic Analysis

سال: 2014

ISSN: 1063-5203

DOI: 10.1016/j.acha.2013.08.005